Minimal Spanning Tree From a Minimum Dominating Set
نویسنده
چکیده
In this article, we provide a constructive procedure to generate a spanning tree for any graph from its dominating set, γ set. We introduce a new kind of minimum dominating set and hence generate a minimum weighted spanning tree from a γ set for G. We also provide a method for generating a minimum weighted spanning tree using adjacency matrix of G. Key–Words: Spanning tree, Minimum dominating set, Minimum weighted spanning tree.
منابع مشابه
Efficiency in exponential time for domination-type problems
Wedesign fast exponential time algorithms for some intractable graph-theoretic problems. Ourmain result states that aminimum optional dominating set in a graph of order n can be found in time O∗(1.8899n). Ourmethods to obtain this result involvematching techniques. The list of the considered problems includes Minimum Maximal Matching, 3Colourability, Minimum Dominating Edge Set, Minimum Connect...
متن کاملPolyhedral studies in Domination Graph Theory (I)
This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...
متن کاملConnected Domination and Spanning Trees with Many Leaves
Let G = (V,E) be a connected graph. A connected dominating set S ⊂ V is a dominating set that induces a connected subgraph of G. The connected domination number of G, denoted γc(G), is the minimum cardinality of a connected dominating set. Alternatively, |V | − γc(G) is the maximum number of leaves in a spanning tree of G. Let δ denote the minimum degree of G. We prove that γc(G) ≤ |V | ln(δ+1)...
متن کاملDistributed One-Hope Algorithm based on Steiner Connected Dominating Set in Wireless Networks
Multicast routing problem is to find a tree rooted at a source node to all multicast destination nodes. In dominating set problem, we are required to find a minimum size subset of vertices that each vertex is either in the dominating set or adjacent to some node in the dominating set. In this paper, we concentrate on the related problem of finding a connected dominating set of minimum size in w...
متن کاملImproved Distributed Algorithms for Fundamental Graph Problems
Distributed graph algorithms provide efficient and theoretically sound methods for solving graph problems in distributed settings and more generally for performing distributed computation in networks. These algorithms are applicable in a wide variety of settings, ranging from computer networks to massively parallel computing and beyond. This thesis addresses a number of the central problems of ...
متن کامل